A new condition for stable recovery of sparse signals from noisy measurements

نویسنده

  • Qiyu Sun
چکیده

The null space property and the restricted isometry property for a measurement matrix are two basic properties in compressive sampling, and are closely related to the sparse approximation. In this paper, we introduce the sparse approximation property of order s for a measurement matrix A: ‖xs‖2 ≤ D‖Ax‖2 + β σs(x) √ s for all x, where xs is the best s-sparse approximation of the vector x in `, σs(x) is the s-sparse approximation error of the vector x in `, and D and β are positive constants. In this paper, we show that the sparse approximation property of a measurement matrix can be thought of as a weaker version of the restricted isometry property and a stronger version of the null space property, and could be an appropriate condition to consider stable recovery of any compressible signal from its noisy measurements. In particular, we show that any compressible signal can be stably recovered from its noisy measurements via solving an `-minimization problem if the measurement matrix has the sparse approximation property with β ∈ (0, 1), and conversely the measurement matrix has the sparse approximation property with β ∈ (0,∞) if any compressible signal can be stably recovered from its noisy measurements via solving an `minimization problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Sharp Sufficient Condition for Sparsity Pattern Recovery

Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...

متن کامل

A New Look at Generalized Orthogonal Matching Pursuit: Stable Signal Recovery under Measurement Noise

Generalized orthogonal matching pursuit (gOMP) is an extension of orthogonal matching pursuit (OMP) algorithm designed to improve the recovery performance of sparse signals. In this paper, we provide a new analysis for the gOMP algorithm for both noiseless and noisy scenarios. We show that if the measurement matrix Φ ∈ R satisfies the restricted isometry property (RIP) with δ7K+N−1 ≤ 0.0231, th...

متن کامل

A New Method for Speech Enhancement Based on Incoherent Model Learning in Wavelet Transform Domain

Quality of speech signal significantly reduces in the presence of environmental noise signals and leads to the imperfect performance of hearing aid devices, automatic speech recognition systems, and mobile phones. In this paper, the single channel speech enhancement of the corrupted signals by the additive noise signals is considered. A dictionary-based algorithm is proposed to train the speech...

متن کامل

A sharp recovery condition for sparse signals with partial support information via orthogonal matching pursuit

This paper considers the exact recovery of k-sparse signals in the noiseless setting and support recovery in the noisy case when some prior information on the support of the signals is available. This prior support consists of two parts. One part is a subset of the true support and another part is outside of the true support. For k-sparse signals x with the prior support which is composed of g ...

متن کامل

Sparse recovery via Orthogonal Least-Squares under presence of Noise

We consider the Orthogonal Least-Squares (OLS) algorithm for the recovery of a m-dimensional k-sparse signal from a low number of noisy linear measurements. The Exact Recovery Condition (ERC) in bounded noisy scenario is established for OLS under certain condition on nonzero elements of the signal. The new result also improves the existing guarantees for Orthogonal Matching Pursuit (OMP) algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011